for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
a=[0]+a
ans=0
for i in range(1,n+1):
ans+=max(0,a[i]-a[i-1])
print(ans-1)#include <bits/stdc++.h>
using namespace std ;
typedef long long ll ;
const ll N=1e6;
void solve()
{
ll n,i,c[N],sum=0;
cin >> n;
if(n==1)
{
cin >> c[0];
cout << c[0]-1 << endl;
return;
}
c[n+1]=0;
for(i=1;i<=n;i++)
cin >> c[i];
for(i=1;i<=n;i++)
if(c[i]-c[i+1]>0) sum+=c[i]-c[i+1];
cout << sum-1 << endl;
}
signed main()
{
ios::sync_with_stdio(false) ;
cin.tie(0) ;
cout.tie(0) ;
int T= 1 ;
cin >> T;
while(T--)
{
solve() ;
}
return 0 ;
}881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |